Warren's Abstract Machine: A Tutorial Reconstruction
نویسنده
چکیده
No part of this book may be reproduced in any form by any electronic or mechanical means (including photocopying, recording, or information storage and retrieval) without permission in writing from the author. All rights reserved. WARREN'S ABSTRACT MACHINE Because they have seen it grow from the start, this modest work is dedicated to: ELI`ES, JAYD, NASSIM, AND JULIETA for much needed love and trusting me, always NANIE for tranquil unconditional faith and being there FORˆET DES FLAMBERTINS for peaceful mornings and conniving whispers giving me some answers iv Reprinted from MIT Press Copyright c
منابع مشابه
A Continuation-Passing Style for Prolog
We propose a translation of Prolog (including cut, if-then-else and similar constructs) into a rst-order continuation-passing style, where (almost) all predicates have one clause and all clauses are binary. The resulting programs can be used as a exible intermediate representation for compilation with a number of advantages as compared to Warren's abstract machine and other proposals. We discus...
متن کاملA Verified Prolog Compiler for the Warren Abstract Machine
We extend the theory of Prolog to provide a framework for the study of Prolog compilation technology. For this purpose, we rst demonstrate the semantic equivalence of two Prolog interpreters: a conventional SLD-refutation procedure and one that employs Warren's \last call" optimization. Next, we formally deene the Warren Abstract Machine (WAM) and its instruction set and present a Prolog compil...
متن کاملParallel Bounded Quantiication|preliminary Results
We have extended D. H. D. Warren's abstract machine for sequential Prolog with parallel instructions that implement bounded quantiica-tions, an extension to Prolog proposed by Barklund and Bevemyr. These instructions are intended for parallel computers supporting the data parallel programming model. Luther, an emulator for the sequential abstract machine implemented in the C programming languag...
متن کاملEecient Interpretation of Prolog Programs
The paper focuses on three ideas for solving problems with writing interpreters for the logic programming language Prolog in Prolog and how to combine these ideas to an interpreter for Prolog which is both simple and eecient. The resulting interpreter system can be incorporated into a Prolog based on Warren's Abstract Machine and built mostly from existing parts of it. The interpreter has been ...
متن کاملFrom Reduction Machines To Narrowing Machines
Narrowing, the evaluation mechanism of functional logic languages, can be seen as a generalization of reduction, the evaluation mechanism of purely functional languages. The unidirec-tional pattern matching, which is used for parameter passing in functional languages, is simply replaced by the bidirectional uniication known from logic programming languages. We show in this paper, how to extend ...
متن کامل